Dynamic Constraint Relaxation Approach
نویسندگان
چکیده
In a past decade, more and more researchers have emphasized the emergent nature of cognition, as opposed to the traditional approach that assumes fixed representations and central control mechanism. Among many kinds of emergent cognition, insight has attacted many researchers’ attention (Sternberg & Davisdon, 1995). Insight has several mysterious properties. First of all, problems used in psychological experiments on insight is far from complex. Many subjects can understand the solution immediately after they are taught. However, it is awfully difficult to find it by themselves. Second, people stick to a wrong approach and repeated same errors. When solving a standard non-insight problem, people usually swith to a different strategy or search other paths after noticing failure. But, they do not do so in insight problem-solving. Third, they ignore useful information accidentally found or generated, and only later they realize its usefulness. Finally, insight appears to come to mind suddenly. These mysterious properties prevent the standard problemsolving framework from providing a coherent account. In order to deal with these problems, we have developed the dynamic constraint relaxation theory of insight (Hiraki & Suzuki, 1998; Suzuki & Hiraki, 1997). This theory consists of three kinds of constraints (objectlevel, relational, and goal), and a relaxation mechanism. The main idea is that impasses are formed by these constraints and that qualitative changes are caused probabilistically by the failure-driven incremental relaxation of these constraints. ∗The researches listed in this paper have done in collaboration with Kazuo Hiraki, Michiko Miyazaki, and Keiga Abe. This research was supported in part by Grant-in-Aid for Scientific Research (C)(No. 10610082) and by Grant-in-Aid for Specially Promoted Research(No. 14001003).
منابع مشابه
SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملTwo approaches to constrained stochastic optimal control problems
In this article, we study and compare two approaches to solving stochastic optimal control problems with an expectation constraint on the final state. The case of a probability constraint is included in this framework. The first approach is based on a dynamic programming principle and the second one uses Lagrange relaxation. These approaches can be used for continuous-time problems; we provide ...
متن کاملMediated Conflict Recovery by Constraint Relaxation
Dynamic events in a multiagent environment can be a source of conflict. We model the network of inter-agent commitments as a constraint graph. Conflicts arise when an event prevents fulfillment of a commitment, resulting in an infeasible constraint graph. Constraint relaxation directed by a mediating agent is used to reconfigure the commitment graph. We investigate this general approach in the ...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل